Multi-objective Binary Search Optimisation
نویسنده
چکیده
منابع مشابه
Evolutionary Multi-Objective Optimisation with a Hybrid Representation
For tackling multi-objective optimisation (MOO) problem, many methods are available in the field of evolutionary computation (EC). To use the proposed method(s), the choice of the representation should be considered first. In EC, often binary representation and real-valued representation are used. In this paper, we propose a hybrid representation, composed of binary and real-valued representati...
متن کاملMulti-Objective Optimisation for Receiver Operating Characteristic Analysis
Receiver operating characteristic (ROC) analysis is now a standard tool for the comparison of binary classifiers and the selection operating parameters when the costs of misclassification are unknown. This chapter outlines the use of evolutionary multi-objective optimisation techniques for ROC analysis, in both its traditional binary classification setting, and in the novel multi-class ROC situ...
متن کاملA nature-inspired multi-objective optimisation strategy based on a new reduced space searching algorithm for the design of alloy steels
In this paper, a salient search and optimisation algorithm based on a new reduced space searching strategy, is presented. This algorithm originates from an idea which relates to a simple experience when humans search for an optimal solution to a ‘real-life’ problem, i.e. when humans search for a candidate solution given a certain objective, a large area tends to be scanned first; should one suc...
متن کاملPolynomial unconstrained binary optimisation - Part 2
The class of problems known as quadratic zero-one (binary) unconstrained optimisation has provided access to a vast array of combinatorial optimisation problems, allowing them to be expressed within the setting of a single unifying model. A gap exists, however, in addressing polynomial problems of degree greater than 2. To bridge this gap, we provide methods for efficiently executing core searc...
متن کاملPolynomial unconstrained binary optimisation – Part 1 Fred Glover
The class of problems known as quadratic zero-one (binary) unconstrained optimisation has provided access to a vast array of combinatorial optimisation problems, allowing them to be expressed within the setting of a single unifying model. A gap exists, however, in addressing polynomial problems of degree greater than 2. To bridge this gap, we provide methods for efficiently executing core searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003